Extending the SACOC algorithm through the Nyström method for dense manifold data analysis
نویسندگان
چکیده
Data analysis has become an important field over the last decades. The growing amount of data demands new analytical methodologies in order to extract relevant knowledge. Clustering is one of the most competitive techniques in this context. Using a dataset as a starting point, clustering techniques aim to blindly group the data by similarity. Among the different areas, manifold identification is currently gaining importance. Spectral-based methods, which are one of the main used methodologies in this area, are sensitive to metric parameters and noise. In order to solve these problems, new bio-inspired techniques have been combined with different heuristics to perform the cluster selection, in particular for dense datasets. Dense datasets are featured by areas of higher density, where there are significantly more data instances than in the rest of the search space. This paper presents an extension of a previous algorithm named Spectral-based Ant Colony Optimization Clustering (SACOC), a spectral-based clustering methodology used for manifold identification. This work focuses on improving the SACOC algorithm through the Nyström extension in order to deal with dense data problems. We evaluated the performance of the proposed approach, called SACON, comparing it against online clustering algorithms and the Nyström extension of the Spectral Clustering algorithm using several benchmark datasets.
منابع مشابه
Large-scale SVD and manifold learning
This paper examines the efficacy of sampling-based low-rank approximation techniques when applied to large dense kernel matrices. We analyze two common approximate singular value decomposition techniques, namely the Nyström and Column sampling methods. We present a theoretical comparison between these two methods, provide novel insights regarding their suitability for various tasks and present ...
متن کاملEmbedding and function extension on directed graph
In this paper, we propose a novel technique for finding the graph embedding and function extension for directed graphs. We assume that the data points are sampled from a manifold and the similarity between the points is given by an asymmetric kernel. We provide a graph embedding algorithm which is motivated by Laplacian type operator on manifold. We also introduce a Nyström type eigenfunctions ...
متن کاملComprehensive Analysis of Dense Point Cloud Filtering Algorithm for Eliminating Non-Ground Features
Point cloud and LiDAR Filtering is removing non-ground features from digital surface model (DSM) and reaching the bare earth and DTM extraction. Various methods have been proposed by different researchers to distinguish between ground and non- ground in points cloud and LiDAR data. Most fully automated methods have a common disadvantage, and they are only effective for a particular type of surf...
متن کاملEnsemble Nyström
A common problem in many areas of large-scale machine learning involves manipulation of a large matrix. This matrix may be a kernel matrix arising in Support Vector Machines [9, 15], Kernel Principal Component Analysis [47] or manifold learning [43,51]. Large matrices also naturally arise in other applications, e.g., clustering, collaborative filtering, matrix completion, and robust PCA. For th...
متن کاملDocument Classification based on Optimal Laprls
To effectively utilize a large number of unlabeled data and a small part of labeled data in the document classification problem, a novel semi-supervised learning algorithm called optimal Laplacian regularized least square (OLapRLS) is proposed in this paper. This algorithm first obtains the data-adaptive edge weights by solving the lnorm optimization problem; then the normalized graph Laplacian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJBIC
دوره 10 شماره
صفحات -
تاریخ انتشار 2017